#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;

int a[N],n,ans,b[N],top,mx;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    for(int i = 1;i<=n;i++){
        scanf("%d",&a[i]);
    }
    sort(a+1,a+n+1);
    for(int i = 1;i<=n;i++){
        if(a[i] != a[i-1]){
            b[++top]++;
        }
        else b[top]++;
    }
    for(int i = 1;i<=top;i++){
        ans = max(ans,b[i]);
    }
    printf("%d",ans);
    return 0;
}
